On the constrained mock-Chebyshev least-squares

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the constrained mock-Chebyshev least-squares

The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge phenomenon, also when the function to be interpolated is analytic. Among all techniques that have been proposed to defeat this phenomenon, there is the mock-Chebyshev interpolation which is an interpolation made on a subset of the given nodes which elements mimic as well as possible the Chebyshev-Loba...

متن کامل

Peak-constrained least-squares optimization

We presented the basic concepts for peakconstrained least-squares (PCLS) optimization in previous papers. We present advanced PCLS optimization concepts in this paper.

متن کامل

On the equivalence of constrained total least squares and structured total least squares

Several extensions of the total least squares (TIS) method that are able to calculate a structured rank deficient approximation of a data matrix have been developed recently. The main result of this correspondence is the demonstration of the equivalence of two of these approaches, namely, the constrained total least squares (CTLS) approach and the structured total least squares (STLS) approach....

متن کامل

On the Complex Least Squares Problem with Constrained Phase

The problem of solving approximately in the least squares sense an overdetermined linear system of equations with complex valued coefficients is considered, where the elements of the solution vector are constrained to have the same phase. A direct solution to this problem is given in [Linear Algebra and Its Applications, Vol. 433, pp. 1719–1721]. An alternative direct solution that reduces the ...

متن کامل

Implicitly Constrained Semi-supervised Least Squares Classification

We introduce a novel semi-supervised version of the least squares classifier. This implicitly constrained least squares (ICLS) classifier minimizes the squared loss on the labeled data among the set of parameters implied by all possible labelings of the unlabeled data. Unlike other discriminative semi-supervised methods, our approach does not introduce explicit additional assumptions into the o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2015

ISSN: 0377-0427

DOI: 10.1016/j.cam.2014.11.032